Answering queries using materialized views with minimum size
نویسندگان
چکیده
منابع مشابه
Answering Queries Using Materialized Views with Disjunctions
We consider the problem of answering datalog queries using materialized views. More speciically, queries are rewritten to refer to views instead of the base relations over which the queries were originally written. Much work has been done on program rewriting that produces an equivalent query. In the context of information integration, though, the importance of using views to infer as many answ...
متن کاملOptimizing Queries with Materialized Views
While much work has addressed the problem of maintaining materialized views, the important question of optimizing queries in the presence of materialized views has not been resolved. In this paper, we analyze the optimization question and provide a comprehensive and eecient solution. Our solution has the desirable property that it is a simple generalization of the traditional query optimization...
متن کاملOptimizing Queries with Materialized Views
While much work has addressed the problem of maintaining materialized views, the important question of optimizing queries in the presence of materialized views has not been resolved. In this paper, we analyze the optimization question and provide a comprehensive and efficient solution. Our solution has the desirable property that it is a simple generalization of the traditional query optimizati...
متن کاملRewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath queries using materialized XPath views. This problem is very important and arises not only from query optimization in server side but also from semantic caching in client side. We consider the problem of deciding whet...
متن کاملRewriting XPath queries using materialized XPath views
Let XP(/, //, [ ]) be the fragment of XPath 1.0, consisting of queries that involve only the child and descendant axes, and predicates without disjunction or negation (and no wildcard nodetests); these queries can be represented as tree patterns. We consider the problem of rewriting a query Q using a materialized view V , where Q,V ∈ XP(/, //, [ ]). We present more efficient algorithms for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2005
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-005-0162-8